Routing Protocol For Sensor Networks Research Articles

Fuzzy logic with honey badger algorithm for cluster‐based multi‐hop routing protocol for wireless sensor networks

SummaryIn the last decades, wireless sensor networks (WSNs) have appeared as an active research area owing to their high applicability in different application areas like healthcare, automation, and the military. Several issues have been encountered in the WSNs, including energy consumption, deployment of sensor nodes, routing algorithms, energy efficiency, cluster head (CH) selection, and robustness. Cluster‐based routing is one of the energy‐efficient solutions in the WSN. At the same time, the hot spot problem remains a challenging problem, which needs to be addressed in the design of energy‐efficient solutions for WSNs. Motivated by the abovementioned discussion, c The comprehensive comparison study pointed out the betterment of the FLHBA‐CMHR technique in terms of different measures. The FLHBA‐CMHR technique obtains a maximum half‐node die (HND) of 1629 nodes, while the LEACH, FUCA, URBD, DEFL, and E‐FUCA techniques attain decreased HND of 793, 1085, 1092, 1139, and 1344 nodes correspondingly.

An Efficient Framework for Localization Based Optimized Opportunistic Routing Protocol in Underwater Acoustic Sensor Networks

An Efficient Framework for Localization Based Optimized Opportunistic Routing Protocol in Underwater Acoustic Sensor Networks

Enhanced reliability in hazardous event detection: A resilient multipath routing protocol for wireless sensor networks

AbstractWith the advance of climate change and the local effects of human activity, it has become of utmost importance to sense spatially extended natural and artificial physical phenomena to predict, monitor, and mitigate hazardous events. Wireless sensor networks are suitable for observing such phenomena, for example, wildfires, floods or landslides, without human supervision. This is due to affordable devices, independent power sources, wireless communication, and a broad range of sensors. During normal operation a few, while during the occurrence of an event a multitude of devices can fail. This leads to further disconnected devices, degrading the network's sensing capabilities. The communication requirements of such applications are difficult to fulfil with general routing protocols. The monitored event is rare compared to the network's lifetime, while its occurrence results in multiple, gradual node failures, still demanding the network to perform reliably. Available routing protocols fail to address every aspect of such application, thus the authors propose the Reliable Resilient Multipath Routing Protocol, designed to construct multiple disjoint paths from each device to a distinguished one, called the sink. The protocol employs proactive and reactive network management techniques to increase connection redundancy and maintain connectivity during failures. To verify the proposed protocol end‐to‐end, we evaluated the supported parameters, performed comparative simulations with routing algorithms known from the literature, and provided estimates of a realistic deployment.

A Taxonomy and Survey on Grid-Based Routing Protocols Designed for Wireless Sensor Networks

Minimization of energy consumption is the main attention of researchers while developing a routing protocol for wireless sensor networks, as sensor nodes are equipped with limited power supply. Virtual topology is an integral part of routing, and grid-based routing protocols are quite popular due to their simplified and efficient virtual grid topology construction. Although a list of surveys exists that either focus on routing protocols in a broader way or on other virtual topologies, none of these surveys are concerned about grid topology and grid-based routing protocols. Having this motivation in mind and considering the impact of these routing protocols on controlling and managing the energy consumption of wireless sensor networks, this article provides an expansive assessment of grid-based routing protocols based on their methodology. In this survey, the existing grid-based routing protocols are classified into two categories from the perspective of sink mobility: static sink and mobile sink. A phase-wise comprehensive overview of these routing protocols is provided in chronological order, along with their comparative analysis. Furthermore, the characteristics, design issues, and challenges of grid-based routing protocols are also provided.

EVRP: A novel geometrical based energy efficient eye vision routing protocol for wireless sensor networks based on the k-means algorithm

The limited energy source used in wireless sensor networks (WSNs) is a crucial aspect when designing a routing protocol. Developing a routing protocol that tries to maximize energy utilization can significantly improve the system's lifetime and balance energy consumption. A novel geometrical-based energy-efficient routing protocol called "EVRP" is presented in this paper. The Cluster generation process is based on the k-means algorithm for nodes grouping. To choose a cluster head (CH) for each cluster, a cost function is calculated for each node considering factors such as remaining energy level for the node, and the mean distance between the node and its neighbors. In the inter-cluster routing phase, a novel geometrical-based routing protocol is introduced considering factors such as the distance to a base station (BS), remaining energy level, and distance between CHs to find the optimal path between BS and CH. The cluster structure is integrated with direct communication in addition to a dynamic clustering mechanism based on the optimum number of CHs and a load balancing mechanism to reduce the load on CHs near BS. The simulation results demonstrate that in different scenarios, the proposed protocol can significantly increase the network lifetime, network throughput, and network stability by 52 %, 45 %, and 30 % respectively compared with the EECRAIFA protocol and by 100 %, 97.6 %, 64.3 % respectively compared with D2CRP protocol.

A novel energy-efficient dynamic programming routing protocol in wireless multimedia sensor networks

Wireless multimedia sensor networks (WMSNs) have characteristics that may influence the routing decisions, such as limited energy resources, storage and computing capacity. Therefore, a routing optimization needs to be done to match the characteristics of the WMSNs. Existing routing protocols only consider energy efficiency regardless of energy threshold, maximum energy, and link cost collectively as the primary basis of routing. In this work, the energy-efficient dynamic programming (EEDP) protocol is proposed to optimize routing decisions that take into account the energy threshold, the maximum energy, and the link cost. Then, the protocol is compared with the dynamic programming (DP), and the ant colony optimization (ACO) protocol. The simulation results show that the EEDP protocol can improve energy efficiency of nodes and network lifetime of the WMSNs. Then, the EEDP protocol is also implemented into a network topology of 10 NodeMCU ESP32 devices. As a result, the EEDP protocol can work very well by selecting routes based on nodes that have the remaining energy above 50 and has the shortest distance. The average delay in sending data for the entire route for the 10 iterations of sending data is 3.99 seconds.

Multi-hop clustering routing protocol design based on simultaneous wireless information and power transfer technology and imperfect spectrum sensing for EH-CRSNs

Existing clustering routing protocols for multi-hop energy harvesting-cognitive radio sensor networks (EH-CRSNs) generally assume perfect spectrum sensing, which is not aligned with the practical spectrum sensing capabilities of nodes in real networks. Additionally, the severe imbalance in residual energy among cluster heads (CHs) negatively affects the successful data delivery. To resolve these problems, this paper introduces a simultaneous wireless information and power transfer (SWIPT)- and imperfect spectrum sensing-based multi-hop clustering routing protocol (ES-ISSMCRP). ES-ISSMCRP makes full use of downlink EH and intra-cluster SWIPT technologies to replenish and equalize the remaining energy among nodes, further extending network lifespan while maintaining network surveillance capabilities. Specifically, to reduce the adverse impact of imperfect spectrum sensing on network performance and improve energy utilization, this paper proposes an EH-based energy level function and associated selection criteria for CHs and relays, facilitating distributed cluster formation and multi-hop routing selection between clusters. To equalize the residual energy among nodes within a cluster, ES-ISSMCRP protocol enables cluster members (CMs) to decide whether employ SWIPT technology with a power splitting (PS) receiver architecture to transmit energy to their CH while sending data. The actual energy value transmitted by CMs using SWIPT technology is deduced by calculating the PS ratio and the expected energy expenditure of nodes for data transmission. Simulation results show that ES-ISSMCRP protocol offers significant improvements over other comparative protocols in terms of extending network lifespan and enhancing network surveillance capabilities.

Energy efficient cluster routing protocol for wireless sensor networks using hybrid metaheuristic approache’s

The development of wireless sensor networks (WSNs) has been particularly notable in the context of smart computing, where various application areas have been identified. These networks consist of self-configured, small sensor nodes with battery power. However, sensors have limited energy and resources at their disposal. When unbalanced nodes exist within the network, it adversely affects the network’s lifetime due to increased power consumption. Designing efficient routing for wireless sensor networks remains a challenging task, particularly in terms of energy efficiency. Optimal solutions to address these challenges involve reducing node energy consumption through the implementation of clustering techniques. The current clustering schemes do not take into account node energy balancing, node density, and scalability when selecting low-energy nodes as cluster heads. The existing system is limited to exploring global opportunities within specified search zones. To enhance the performance of WSNs, a hybrid approach combining artificial bee colony (ABC) and ant colony optimization (ACO) has been developed. This approach helps in selecting an ideal cluster head from a group of terminals. Several factors are considered in the cluster head election, including residual energy at the nodes, distance to neighbors, distance to the base station, node degree, and node centrality. ACO determines the path between the cluster leader and the base station (BS) by selecting the most efficient route in terms of distance, remaining power, and node degrees. The performance of this proposed methodology has been analyzed in terms of energy consumption, network lifetime, and data packets at the base station. A comparison has been made between the outputs of the proposed methods and traditional benchmarking methods. The results reveal a substantial improvement in the average network lifetime, showcasing an increase of 40.50%, 33.17%, 25.00%, and 15.49% when compared to LEACH, Beecluster, iABC, and BeeSensor, respectively. In terms of alive nodes, our solution surpasses LEACH, Beecluster, iABC, and BeeSensor by 28.7%, 22.51%, 20.95%, and 12.47%, respectively. Additionally, the energy consumption of our approach proves to be significantly lower than LEACH, Beecluster, iABC, and BeeSensor, recording reductions of 47.25%, 32.40%, 27.38%, and 22.20%, respectively.

Yellow Saddle Goatfish Optimization Algorithm based Energy Aware Multihop Routing Protocol for Wireless Sensor Networks

Yellow Saddle Goatfish Optimization Algorithm based Energy Aware Multihop Routing Protocol for Wireless Sensor Networks

Advancing Wireless Sensor Networks through Performance Evaluation of M-PDCH Routing Protocol for Enhanced Quality of Service

Objective: The decisive aim of this investigation is to improve the capabilities and limitations of PEGASIS with Double Cluster Head (PDCH), for enhancing the overall Quality of Service (QoS) in Wireless Sensor Networks (WSNs). Methods: This research is intended at the application of efficient routing protocol for wireless sensor networks. It works on the principle of the formation of cluster head and clustering. This is accomplished to achieve high QoS for WSN. Improving the efficacy of a WSN protocol is decisive for optimizing communication, resource utilization, and overall effectiveness. An innovative and novel protocol named Mobile-PDCH (M-PDCH) has been devised, developed, and tested. Here several parameters have been carefully investigated for enhancing the performance of a WSN protocol such as energy consumption, delay, and packet loss. A simulation environment has been created to evaluate, compare, and validate the performance and to suggest the desired applications of the proposed protocol. Findings: In the hierarchical category, PDCH performs better compared to all the other protocols. But it suffers from high packet drop, which decrease the performance of the protocol. To improve the performance of sensor networks, there is a need for adaptive routing protocol. The examination of simulation outcomes for the recommended protocol, M-PDCH, has been conducted in comparison with PDCH. The findings indicate that the protocol exhibits superior performance. The proposed algorithm improves the packet drop by 29.75%, reduces delay by 23.28%, and lowers energy consumption by 19.18% when compared to PDCH. Novelty: A novel adaptive routing protocol termed M-PDCH has been proposed for the enhancement of the WSN life span and durability of the sensor nodes. The simulation results show that the proposed algorithm produces better results compared to PDCH protocol. The various QoS parameter results are compared, verified, and validated with existing protocol PDCH. Keywords: WSN, PDCH, Design issues, Metrics, QoS, HRP

A Routing Protocol for Underwater Acoustic-Optical Hybrid Wireless Sensor Networks Based on Packet Hierarchy and Void Processing

A Routing Protocol for Underwater Acoustic-Optical Hybrid Wireless Sensor Networks Based on Packet Hierarchy and Void Processing

Energy-efficient cluster-based routing protocol for heterogeneous wireless sensor network

Energy-efficient cluster-based routing protocol for heterogeneous wireless sensor network

A Systematic Analysis, Outstanding Challenges, and Future Prospects for Routing Protocols and Machine Learning Algorithms in Underwater Wireless Acoustic Sensor Networks

Water has covered a wide part of the earth’s surface. Oceans and other water bodies contain significant natural and environmental resources as well as aquatic life. Due to humans’ hazardous and unsuitable underwater (UW) settings, these are generally undiscovered and unknown. As a result of its widespread utility in fields as diverse as oceanography, ecology, seismology, and oceanography, underwater wireless sensor networks (UWSNs) have emerged as a cutting-edge area of study. Despite their usefulness, the performance of the network is hampered by factors including excessive propagation delay, a changing network architecture, a lack of bandwidth, and a battery life that is too short on sensor nodes. Developing effective routing protocols is the best way to overcome these challenges. An effective routing protocol can relay data from the network’s root node to its final destination. Therefore, the state of the art in underwater wireless acoustic sensor network (UWASN) routing protocols is assessed with an eye toward their potential for development. In real-world applications, sensor node positions are frequently used to locate relevant information. As a result, it is crucial to conduct research on routing protocols. Reinforcement learning (RL) algorithms have the ability to enhance routing under a variety of conditions because they are experience-based learning algorithms. Underwater routing methods for UWSN are reviewed in detail, including those that rely on machine learning (ML), energy, clustering and evolutionary approaches. Tables are incorporated for the suggested protocols by including the benefits, drawbacks, and performance assessments, which make the information easier to digest. Also, several applications of UWSN are discussed with security considerations. In addition to this, the analysis of node deployment and residual energy is discussed in this review. Furthermore, the domain review emphasizes UW routing protocol research difficulties and future directions, which can help researchers create more efficient routing protocols based on ML in the future.

Multi-objective may-badger optimizer based energy efficient routing protocol in dense wireless sensor network

Multi-objective may-badger optimizer based energy efficient routing protocol in dense wireless sensor network

Performance enhancement of efficient clustering and routing protocol for wireless sensor networks using improved elephant herd optimization algorithm

Performance enhancement of efficient clustering and routing protocol for wireless sensor networks using improved elephant herd optimization algorithm

WOAD3QN-RP: An intelligent routing protocol in wireless sensor networks — A swarm intelligence and deep reinforcement learning based approach

Wireless Sensor Networks (WSN) are a crucial part of the Internet of Things (IoT), and research on WSN routing protocols has always been a hot topic in academia. However, traditional WSN routing protocols have limited utilization of available information during the routing decision process, leading to challenges such as insufficient adaptability to network topology changes, high communication delays, and short network lifetimes. To address these issues, this paper proposes an innovative intelligent routing algorithm WOAD3QN-RP, which cleverly integrates swarm intelligence algorithms and deep reinforcement learning. The WOAD3QN-RP not only effectively reduces delay but also balances energy consumption and flexibly adapts to changes in network topology, while simultaneously determining the optimal multi-hop path, effectively extending the lifetime of the network. Firstly, the WOAD3QN-RP algorithm employs the Whale Optimization Algorithm (WOA) to determine the optimal cluster heads (CHs). In the process of selecting CHs, the algorithm comprehensively considers key factors such as the residual energy of nodes, node distance, and communication delay, thereby significantly improving the accuracy and efficiency of CH selection, which contributes to better energy distribution and performance of the network. Secondly, in terms of multi-hop path selection, WOAD3QN-RP uses a dueling double deep Q-network (D3QN) to determine the optimal multi-hop path. Through utilizing neural networks to interact with the environment, intelligent agents are trained to learn routing policies to adapt to dynamic changes in the network topology and ensure the balance between energy consumption and multi-hop routing performance. Experimental results show that WOAD3QN-RP exhibits significant advantages over existing routing protocols in terms of network lifetime, energy efficiency, and communication delay.

Routing Methods For Data Transmission In Large Networks: A Review

A wireless sensor network (WSN) is a network consisting of miniaturized smart sensors communicating the information gathered or collected from a monitored environment via a wireless link. The sensors are capable of sensing the events within their environment, process the data, and transmit the data to the base station (BS). The entire processing of data and subsequent transmission to BS requires high energy consumption. The operation of WSN is limited by repeated dead nodes, which results in energy depletion. Hence, to prolong the life-span of the network, several routing protocols have been developed. However, the effectiveness of these protocols has not been well examined in terms of increasing node population for a given WSN field or area. Therefore, in this work the effect of increasing node density on cluster based energy-efficient routing protocols in wireless sensor network was analysed. The implemented routing protocols were Low Energy Adaptive Clustering Hierarchy LEACH, stable election protocol (SEP), and zone-SEP (Z-SEP). The dimension of the WSN was 100 × 100 square metre area with varying number of sensor nodes: 50, 60, 70, 80, 90, and 100. The results of the simulation conducted in MATLAB revealed that increasing node density resulted in increased alive node and throughput (measures in terms of transmitted number of packets). On the contrary, the protocol with the best performance was ZSEP.

Cluster-based energy-efficient routing protocol in next generation sensor networks

Cluster-based energy-efficient routing protocol in next generation sensor networks

Node utilization index-based data routing and aggregation protocol for energy-efficient wireless sensor networks

Node utilization index-based data routing and aggregation protocol for energy-efficient wireless sensor networks

A Novel Particle Swarm Optimization-Based Clustering and Routing Protocol for Wireless Sensor Networks

A Novel Particle Swarm Optimization-Based Clustering and Routing Protocol for Wireless Sensor Networks